Satisfiability and Completeness of Converse-PDL Replayed
نویسنده
چکیده
This paper reinvestigates the satisfiability problem and the issue of completeness for Propositional Dynamic Logic with Converse. By giving a game-theoretic characterisation of its satisfiability problem using focus games, an axiom system that is extracted from these games can easily be proved to be complete.
منابع مشابه
Satisfiability and Completeness of PDL replayed
This paper reinvestigates satisfiability and completeness for PDL. Automata-theoretic methods have been successful for solving sat-isfiability so far, but it is not known how to use them for proving completeness of axiom systems. By solving PDL's satisfiability problem using the rather novel approach of focus games, a complete axiom system can easily be read off the game rules.
متن کاملPDL with Intersection and Converse is 2EXP-complete
We study the complexity of satisfiability in the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Our main result is containment in 2EXP, which improves the previously known non-elementary upper bound and implies 2EXPcompleteness due to an existing lower bound for PDL with intersection. The proof proceeds by showing t...
متن کاملEliminating "Converse" from Converse PDL
In this paper we show that it is possible to eliminate the converse operator from the propositional dynamic logic CPDL Converse PDL without compromising the soundness and completeness of inference for it Speci cally we present an encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula but adds enough information so as not to destroy its original meaning with...
متن کاملPDL with intersection and converse: satisfiability and infinite-state model checking
We study satisfiability and infinite-state model checking in ICPDL, which extends Propositional Dynamic Logic (PDL) with intersection and converse operators on programs. The two main results of this paper are that (i) satisfiability is in 2EXP, thus 2EXP-complete by an existing lower bound, and (ii) infinite-state model checking of basic process algebras and pushdown systems is also 2EXP-comple...
متن کاملModel checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all these operators, in contrast to the high increase in complexity that they cause for the satisfia...
متن کامل